package btree.traversal;

public class Btree {
	
	public int getTreeHeight(TreeNode root)
	{
	    if(root==null)
	    {
	    	return 0;
	    }
	    else if(root.left==null&&root.right==null)
	    {
	    	return 1;
	    }
	    else
	    {
	    	return Math.max(getTreeHeight(root.left), getTreeHeight(root.right));
	    }
	}

}
